Corrigenda: Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
نویسندگان
چکیده
منابع مشابه
Monte-Carlo Tree Search for the Physical Travelling Salesman Problem
The significant success of MCTS in recent years, particularly in the game Go, has led to the application of MCTS to numerous other domains. In an ongoing effort to better understand the performance of MCTS in open-ended realtime video games, we apply MCTS to the Physical Travelling Salesman Problem (PTSP). We discuss different approaches to tailor MCTS to this particular problem domain and subs...
متن کاملGeneralized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford [Letchford, A. N. 2000. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25 443–454] by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints. Just as Letchford’s domino-parity constraints generalize comb inequalities, GDP constraints generalize the m...
متن کاملA fundamental problem in linear inequalities with applications to the travelling salesman problem
We consider a system of m linearly independent equality constraints in n nonnegat ive variables: A x = b, x >= O. The fundamenta l problem that we discuss is the following: suppose we are given a set o f r linearly independent co lumn vectors o f A, known as the special column vectors. The problem is to develop an efficient algorithm to determine whether there exists a feasible basis which cont...
متن کاملOn Random Symmetric Travelling Salesman Problems
Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp jZTSP Z2FAC j = o(1). The proof is via by the analysis of a polynomial time algorithm that nds a tour only a little longer than Z2FAC .
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 1987
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.12.1.182